#pragma comment(linker, "/STACK:10000000")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#include <cassert>
#include <string>
#include <cstring>
#define ldb long double
#define LL long long
#define fi first
#define se second
#define fill(a, c) memset(a, c, sizeof(a))
#define sqr(a) ((a) * (a))
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define getBit(mask, k) (((mask) / pw[k]) % pw[1])
#define setBit(mask, k, l) (((mask) / pw[k + 1] * pw[1] + (l)) * pw[k] + ((mask) % pw[k]))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb LDINF = 9128739847123.00;
const ldb eps = 1e-9;
const int INF = 1 << 30;
const ldb pi = fabsl(atan2(0.0, -1.0));
using namespace std;

vector <pair <int, ldb> > res[52];


void Load()
{
	cin >> n >> w >> m;
}

void Solve()
{
	if (2 * n < m)
	{
		cout << "NO";
		return;
	}
	int i;
	for (i = 0; i < n / (m - 1); i++)
	{
		ldb x = (ldb)w * (m - 1) / (ldb)m;
	 	for (int j = 0; j < m - 1; j++)
	 	{
	 		res[j].push_back(make_pair(i * (m - 1) + j, x));
	 		res[m - 1].push_back(make_pair(i * (m - 1) + j, w - x));
	 	}
	}
	int lst = n - (n % (m - 1));
	if (m % 2 == 0)
	{
		for (int j = 0; j < (n % (m - 1)); j++)
		{
			tocalc[(j * 2) % m].push_back(j);
			tocalc[(j * 2 + 1) % m].push_back(j);
		}
		for (int j = 0; j < m; j += 2)
		{
			for (int k = 0; k < tocalc[j].size(); k++)
			{
				x[]	
				
			}
		}
	}

}

#define file "b"
int main()
{
	#ifndef ONLINE_JUDGE
		freopen(file".in", "rt", stdin);
		freopen(file".out", "wt", stdout);
	#endif
	Load();
	Solve();
	return 0;
}
